An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs
نویسندگان
چکیده
We propose a new fast algorithm for solving the Maximum Common Subgraph (MCS) problem. MCS is an NP-complete problem. In this paper, we focus on a special class of graphs, i.e. Planar Triangulation Graphs, which are commonly used in computer vision, pattern recognition and graphics. By exploiting the properties of Planar Triangulation Graphs and restricting the problem to connected MCS, for two such graphs of size n and m and their maximum common subgraph of size k, our algorithm solves the MCS problem approximately with time complexity O(nmk).
منابع مشابه
Bounded Degree Planar Geometric Spanners
Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong planar t-spanner of P with t = (1 + √ 2) ∗ δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, given a Delaunay triangulation, we show a distributed algorithm that computes the same bounded degree planar sp...
متن کاملSelf-stabilizing algorithms for the planarization problem in complete bipartite networks
The maximum planarization problem asks to find a spanning planar subgraph having the largest number of edges. In this paper, we propose two simple selfstabilizing algorithms for this problem in complete bipartite graphs. The first one is an approximation algorithm; it finds a planar subgraph of approximation ratio 0.6 in the average case. Based on the techniques used in the first algorithm, the...
متن کاملMaximum Planar Subgraphs and Nice Embeddings :
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a number of topological and aesthetic constraints. Nice drawings for sparse nonplanar graphs can be achieved by determining a maximum planar subgraph and augmenting an embedding of this graph. This approach appears to be of limited value in practice, because the maximum planar subgraph problem is NP-...
متن کاملOn Geometric Spanners of Euclidean Graphs and their Applications in Wireless Networks
We consider the problem of constructing a bounded-degree planar geometric spanner for a unit disk graph modeling a wireless network. The related problem of constructing a planar geometric spanner of a Euclidean graph has been extensively studied in the literature. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor ; however, its degree may not be bound...
متن کاملApproximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced. The results of an extensive study of the performance of these and existing MIPS approximation algorithms on randomly generated graphs are presented. Efficient algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013